On the Planarity of Graphs Associated with Symmetric and Pseudo Symmetric Numerical Semigroups
نویسندگان
چکیده
Let S(m,e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call graph GS an S(m,e)-graph if there exists semigroup S∈S(m,e) V(GS)={x:x∈g(S)} E(GS)={xy⇔x+y∈S}, where g(S) denotes the gap set S. The aim this article is to discuss planarity S(m,e)-graphs for some cases S irreducible semigroup.
منابع مشابه
On Symmetric Numerical Semigroups
A numerical semigroup is a subset S of N such that is closed under sums, contains the zero and generates Z as a group. From this definition Ž w x. Ž one obtains see, for example, 2 that S has a conductor C i.e., the . maximum among all the natural numbers not belonging to S . A numerical semigroup S is called symmetric if for every integer z f S, C y z g S. The study of the subsemigroups of N i...
متن کاملSymmetric Numerical Semigroups with Arbitrary Multiplicity and Embedding Dimension
We construct symmetric numerical semigroups S for every minimal number of generators μ(S) and multiplicity m(S), 2 ≤ μ(S) ≤ m(S) − 1. Furthermore we show that the set of their defining congruence is minimally generated by μ(S)(μ(S) − 1)/2 − 1 elements.
متن کاملnew semigroup compactifications via the enveloping semigroups of associated flows
this thesis deals with the construction of some function algebras whose corresponding semigroup compactification are universal with respect to some properies of their enveloping semigroups. the special properties are of beigan a left zero, a left simple, a group, an inflation of the right zero, and an inflation of the rectangular band.
15 صفحه اولClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11071681